New recurrences for Euler''s partition function
نویسندگان
چکیده
منابع مشابه
The Dimer Partition Function
We apply the Ginzburg criterion to the dimer problem and we solve the apparent contradiction of a system with mean field α = 12 , the typical value of tricritical systems, and upper critical dimension Dcr = 6. We find that the system has upper critical dimensionDcr = 6 , while for D ≤ 4 it should undergo a first order phase transition. We comment on the latter wrong result examining the approxi...
متن کاملThe Partition Function Revisited
In 1918, Hardy and Ramanujan wrote their landmark paper deriving the asymptotic formula for the partition function. The paper however was fundamental for another reason, namely for introducing the circle method in questions of additive number theory. Though this method is powerful, it is often difficult and technically complicated to employ. In 2011, Bruinier and Ono discovered a new algebraic ...
متن کاملOn Stanley's Partition Function
Stanley defined a partition function t(n) as the number of partitions λ of n such that the number of odd parts of λ is congruent to the number of odd parts of the conjugate partition λ modulo 4. We show that t(n) equals the number of partitions of n with an even number of hooks of even length. We derive a closed-form formula for the generating function for the numbers p(n)− t(n). As a consequen...
متن کاملA Core Concept for Partition Function Games
In this paper, we introduce a new core concept for partition function games, to be called the strong-core, which reduces to the ordinary core if the worth of every coalition is independent of the partitions to which it belongs and the game is adequately represented by a characteristic function. It is nicely related to previous core concepts, but unlike them does not assume formation of a specif...
متن کاملAn Arithmetic Formula for the Partition Function
Although there is a vast literature on the properties of p(n), typically motivated by work of Ramanujan, some of the simplest questions remain open. For example, little is known about p(n) modulo 2 and 3. Most results concerning the congruence properties of p(n) have been proved using properties of (1.1). Theorems typically depend on q-series identities, the theory of modular equations, or the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS
سال: 2017
ISSN: 1300-0098,1303-6149
DOI: 10.3906/mat-1604-124